New Pseudorandom Sequences Constructed by Quadratic Residues and Lehmer Numbers
نویسندگان
چکیده
Let p be an odd prime. Define en = { (−1), if n is a quadratic residue mod p, (−1)n+n+1, if n is a quadratic nonresidue mod p, where n is the multiplicative inverse of n modulo p such that 1 ≤ n ≤ p − 1. This paper shows that the sequence {en} is a “good” pseudorandom sequence, by using the properties of exponential sums, character sums, Kloosterman sums and mean value theorems of Dirichlet L-functions.
منابع مشابه
Chapter 9 Random Numbers
This chapter describes algorithms for the generation of pseudorandom numbers with both uniform and normal distributions. This is the first number produced by the Matlab random number generator with its default settings. Start up a fresh Matlab, set format long, type rand, and it's the number you get. If all Matlab users, all around the world, all on different computers, keep getting this same n...
متن کاملA Very High-Speed Digital Number Sieve
such that N is a solution to s of the congruences. (It is, of course, clear that no Ar can be a solution to more than s of the congruences (1).) Examples : On the one extreme there is the Sieve of Eratosthenes for finding all primes p in the range A = B12 ^ p < B, where ti = m, — 1 for all i. (Here to, are all the primes < Bl .) On the other extreme there is the Chinese remainder type of proble...
متن کاملA remark on Giuga’s conjecture and Lehmer’s totient problem∗
Giuga has conjectured that if the sum of the (n− 1)-st powers of the residues modulo n is −1 (mod n), then n is 1 or prime. It is known that any counterexample is a Carmichael number. Lehmer has asked if φ(n) divides n−1, with φ being Euler’s function, must it be true that n is 1 or prime. No examples are known, but a composite number with this property must be a Carmichael number. We show that...
متن کاملA New Distribution Family Constructed by Fractional Polynomial Rank Transmutation
In this study‎, ‎a new polynomial rank transmutation is proposed with the help of‎ ‎ the idea of quadratic rank transmutation mapping (QRTM)‎. ‎This polynomial rank‎ ‎ transmutation is allowed to extend the range of the transmutation parameter from‎ ‎ [-1,1] to [-1,k]‎‎. ‎At this point‎, ‎the generated distributions gain more&lrm...
متن کاملA new pseudorandom number generator based on complex number chaotic equation ∗
In recent years, various chaotic equation based pseudorandom number generators have been proposed, however, the chaotic equations are all defined in the real number field. In this paper, an equation is proposed and proved to be chaotic in the imaginary axis. And a pseudorandom number generator is constructed based on the chaotic equation. The alteration of the definitional domain of the chaotic...
متن کامل